ProGS: Property Graph Shapes Language
نویسندگان
چکیده
Knowledge graphs such as Wikidata are created by a diversity of contributors and range sources leaving them prone to two types errors. The first type error, falsity facts, is addressed property through the representation provenance validity, making triples occur first-order objects in subject position metadata triples. second violation domain constraints, has not been with regard so far. In RDF representations, this error can be shape languages SHACL or ShEx, which allow for checking whether valid respect set constraints. Borrowing ideas from syntax semantics definitions SHACL, we design language graphs, ProGS, allows formulating constraints on including their specific constructs, edges identities key-value annotations both nodes edges. We define formal investigate resulting complexity validating against sets ProGS shapes, compare corresponding results implement prototypical validator that utilizes answer programming.
منابع مشابه
Canonical Graph Shapes
Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding results in large individual states and large, or even unbounded, state spaces. As usual, some form of abstraction is necessary in order to arrive at a tractable model. In this paper we propose a decidable fragment of first-order grap...
متن کاملShapes as property restrictions and property-based similarity
In this work we look into the details of modeling shapes in an ontology as property restrictions on classes. In this way shapes do not have to be categorized in an exhaustive hierarchy and there is no need to take immediate decisions on how to group the objects, it is rather possible to individualize some important characteristics of shapes and use them as the basis for their categorization and...
متن کاملHow Kinetic Property Shapes Novelty Perceptions
This paper demonstrates a new substantive finding kinetic property in advertising, defined as direction changes in the paths of moving on-screen ad elements, enhances consumer judgments of product novelty. Across six studies, we first outline an inference-based theory as to why the novelty-enhancing effect of kinetic property manifests – kinetic property generates impressions of how visually li...
متن کاملNon-Deterministic Graph Property Testing
A property of finite graphs is called nondeterministically testable if it has a “certificate” such that once the certificate is specified, its correctness can be verified by random local testing. In this paper we study certificatees that consist of one or more unary and/or binary relations on the nodes, in the case of dense graphs. Using the theory of graph limits, we prove that nondeterministi...
متن کاملThe smallest nonevasive graph property
A property of n-vertex graphs is called evasive if every algorithm testing this property by asking questions of the form “is there an edge between vertices u and v” requires, in the worst case, to ask about all pairs of vertices. Most “natural” graph properties are either evasive or conjectured to be such, and of the few examples of nontrivial nonevasive properties scattered in the literature t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-88361-4_23